基于残差决策的自动飞行控制系统远程实时故障诊断

针对自动飞行控制系统结构复杂、关联部件众多,发生故障时诊断时间长,从而影响飞机运行效率的问题,提出一种基于飞机通信寻址报告系统(ACARS)的远程实时故障诊断方案。首先,分析自动飞行控制系统的故障特点,设计搭建检测滤波器;然后,利用ACARS数据链实时发送的自动飞行控制系统的关键信息进行相关部件的残差计算,并根据残差决策算法进行故障诊断及定位;最后,针对不同故障部件残差间的差异大、决策门限无法统一的缺点,提出基于二次差值的残差决策改进算法,减缓了检测对象的整体变化趋势,降低了随机噪声和干扰的影响,避免了将瞬态故障诊断为系统故障的情况。实验仿真结果表明,基于二次差值的改进残差决策算法避免了多决策门限的复杂性,在采样时间为0.1 s的情况下,故障检测所需时间大约为2 s,故障检测时间大幅降低,有效故障检测率大于90%。     

Relevance- and interface-driven clustering for visual information retrieval

Search results of spatio-temporal data are often displayed on a map, but when the number of matching search results is large, it can be time-consuming to individually examine all results, even when using methods such as filtered search to narrow the content focus. This suggests the need to aggregate results via a clustering method. However, standard unsupervised clustering algorithms like $K$-means (i) ignore relevance scores that can help with the extraction of highly relevant clusters, and (ii) do not necessarily optimize search results for purposes of visual presentation. In this article, we address both deficiencies by framing the clustering problem for search-driven user interfaces in a novel optimization framework that (i) aims to maximize the relevance of aggregated content according to cluster-based extensions of standard information retrieval metrics and (ii) defines clusters via constraints that naturally reflect interface-driven desiderata of spatial, temporal, and keyword coherence that do not require complex ad-hoc distance metric specifications as in $K$-means. After comparatively benchmarking algorithmic variants of our proposed approach – RadiCAL – in offline experiments, we undertake a user study with 24 subjects to evaluate whether RadiCAL improves human performance on visual search tasks in comparison to $K$-means clustering and a filtered search baseline. Our results show that (a) our binary partitioning search (BPS) variant of RadiCAL is fast, near-optimal, and extracts higher-relevance clusters than $K$-means, and (b) clusters optimized via RadiCAL result in faster search task completion with higher accuracy while requiring a minimum workload leading to high effectiveness, efficiency, and user satisfaction among alternatives.     

管道清管器运行速度控制技术研究进展

随着对管道安全问题和降本增效理念的逐步重视，管道清管操作已成为全世界油气管道运行中必不可少的作业规程，清管器的运行速度是需要重点控制的参数之一，当其处于合理区间内时（原油管道1~5m/s，天然气管道2~7m/s），清管效果最佳。本文基于对管道清管数学模型的研究，首先论述了不同的被动控制方法，认为该方法较为灵活，应用广泛，对不同入口条件下清管器速度的准确计算是能否控制清管器速度处于合理区间的关键；然后对不同的主动控制方法进行了研究，研究表明：射流清管器速度控制的核心是旁通率的优选，其依赖于压降系数、皮碗与管壁间摩擦力的准确计算，建立简便可靠的摩擦力工程计算模型将有助于射流清管技术应用的进一步推广；最终本文对清管器智能调速技术进行综述和展望，指出发展稳定可靠的国产智能调速技术是未来重点研究方向。     

基于2D激光扫描的基准检测技术研究

在机器人自动制孔系统中,基准孔检测的准确性会直接影响整个机器人制孔过程的位置精度。为获取基准孔孔位准确信息,采用激光扫描的方式对基准孔进行检测。设计了2D线激光扫描在基准平面内点云的三维转化方法,通过分析基准孔在扫描仪坐标系下点云的分布特点,提出了一种基于坐标差值的基准孔边界提取算法。通过设定相邻点云在线激光扫描仪坐标系下z轴的坐标差值获取边界点,实验验证该算法能有效地去除点云中的噪声点,获取准确的基准孔边缘特征信息,进而得到准确的基准孔孔位信息。     

一种新型随钻轨迹仪的研制

针对现有随钻轨迹仪工作时间短、需人工同步、"数钻杆"记录钻孔深度不足等问题,采用深度实时测量技术、电源智能管理技术和数据自动同步与成图等关键技术,研制了新型随钻轨迹仪。该仪器由直线位移传感器、压力传感器、霍尔开关等组成,具有钻孔深度自动测量、电源智能管理、测量数据与深度自动匹配等功能。试验结果表明:新型钻孔轨迹仪工作稳定可靠、无需人工干预、工作时间长、生产效率高。     

Group search optimization for economic fuel scheduling

The economical use of fuel available for the generation of power has become a major concern of electric utilities. This paper presents an approach for economic fuel scheduling problem by using group search optimization. This is a minimization technique that includes the standard load constraints as well as the fuel constraints. The generation schedule is compared to that which would result if fuel constraints were ignored. The comparison shows that fuel consumed can be adequately controlled by adjusting the power output of various generating units so that the power system operates within its fuel limitations and within contractual constraints. It has been found that small additional amount of fuel may be required to serve the same power demand but the additional cost of this fuel may well compensate for the penalty that might otherwise be imposed for not maintaining the fuel contract. Numerical results for two test systems have been presented and the test results obtained from group search optimization are compared with those obtained from particle swarm optimization and evolutionary programming.     

Mímir: An open-source semantic search framework for interactive information seeking and discovery

Semantic search is gradually establishing itself as the next generation search paradigm, which meets better a wider range of information needs, as compared to traditional full-text search. At the same time, however, expanding search towards document structure and external, formal knowledge sources (e.g. LOD resources) remains challenging, especially with respect to efficiency, usability, and scalability.This paper introduces Mímir—an open-source framework for integrated semantic search over text, document structure, linguistic annotations, and formal semantic knowledge. Mímir supports complex structural queries, as well as basic keyword search.Exploratory search and sense-making are supported through information visualisation interfaces, such as co-occurrence matrices and term clouds. There is also an interactive retrieval interface, where users can save, refine, and analyse the results of a semantic search over time. The more well-studied precision-oriented information seeking searches are also well supported.The generic and extensible nature of the Mímir platform is demonstrated through three different, real-world applications, one of which required indexing and search over tens of millions of documents and fifty to hundred times as many semantic annotations. Scaling up to over 150 million documents was also accomplished, via index federation and cloud-based deployment.     

An adaptive local search algorithm for vehicle routing problem with simultaneous and mixed pickups and deliveries

The Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD) is an extension to the classical Vehicle Routing Problem (VRP), where customers may both receive and send goods simultaneously. The Vehicle Routing Problem with Mixed Pickup and Delivery (VRPMPD) differs from the VRPSPD in that the customers may have either pickup or delivery demand. However, the solution approaches proposed for the VRPSPD can be directly applied to the VRPMPD. In this study, an adaptive local search solution approach is developed for both the VRPSPD and the VRPMPD, which hybridizes a Simulated Annealing inspired algorithm with Variable Neighborhood Descent. The algorithm uses an adaptive threshold function that makes the algorithm self-tuning. The proposed approach is tested on well-known VRPSPD and VRPMPD benchmark instances derived from the literature. The computational results indicate that the proposed algorithm is effective in solving the problems in reasonable computation time.     

Apparent power-law distributions in animal movements can arise from intraspecific interactions

Lévy flights have gained prominence for analysis of animal movement. In a Lévy flight, step-lengths are drawn from a heavy-tailed distribution such as a power law (PL), and a large number of empirical demonstrations have been published. Others, however, have suggested that animal movement is ill fit by PL distributions or contend a state-switching process better explains apparent Lévy flight movement patterns. We used a mix of direct behavioural observations and GPS tracking to understand step-length patterns in females of two related butterflies. We initially found movement in one species (Euphydryas editha taylori) was best fit by a bounded PL, evidence of a Lévy flight, while the other (Euphydryas phaeton) was best fit by an exponential distribution. Subsequent analyses introduced additional candidate models and used behavioural observations to sort steps based on intraspecific interactions (interactions were rare in E. phaeton but common in E. e. taylori). These analyses showed a mixed-exponential is favoured over the bounded PL for E. e. taylori and that when step-lengths were sorted into states based on the influence of harassing conspecific males, both states were best fit by simple exponential distributions. The direct behavioural observations allowed us to infer the underlying behavioural mechanism is a state-switching process driven by intraspecific interactions rather than a Lévy flight.     

基于改进GSO的裂解炉原料切换策略研究(英文)

The scheduling process of cracking furnace feedstock is important in an ethylene plant. In this paper it is described as a constraint optimization problem. The constraints consist of the cycle of operation, maximum tube metal temperature, process time of each feedstock, and flow rate. A modified group search optimizer is pro-posed to deal with the optimization problem. Double fitness values are defined for every group. First, the factor of penalty function should be changed adaptively by the ratio of feasible and general solutions. Second, the“excel-lent”infeasible solution should be retained to guide the search. Some benchmark functions are used to evaluate the new algorithm. Final y, the proposed algorithm is used to optimize the scheduling process of cracking furnace feedstock. And the optimizing result is obtained.